Hi! I'm a fifth year PhD student in EECS at MIT, advised by Ronitt Rubinfeld. I'm interested in pseudorandomness, graph theory, space complexity, and more. As an undergraduate, I was extremely fortunate to be advised by Salil Vadhan. If you have questions or comments, please reach out!
I am on the job market this year!
epyne [at] mit.edu
Graph Spectral Sparsification is in Catalytic Logspace. [arXiv:2608.21594]
with Cassandra Marcussen and Ronitt Rubinfeld.
Composing Low Space Algorithms. [ECCC-TR25-140] [Oded's Choices]
with Roei Tell.
FOCS 2026 (to appear).
Efficient Catalytic Graph Algorithms. [arXiv:2509.06209]
with James Cook.
ITCS 2026.
Collapsing Catalytic Classes. [ECCC-TR25-019]
with Michal Koucký, Ian Mertz, and Sasha Sami.
FOCS 2025.
When Connectivity is Hard, Random Walks are Easy With Non-Determinism. [ECCC-TR25-077]
with Dean Doron, Roei Tell, and Ryan Williams.
STOC 2025.
Derandomizing Logspace With a Small Shared Hard Drive. [ECCC-TR23-168]
CCC 2024. Invited to special issue of Computational Complexity.
Best Student Paper.